Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
from(X) |
→ cons(X,from(s(X))) |
| 2: |
|
after(0,XS) |
→ XS |
| 3: |
|
after(s(N),cons(X,XS)) |
→ after(N,XS) |
|
There are 2 dependency pairs:
|
| 4: |
|
FROM(X) |
→ FROM(s(X)) |
| 5: |
|
AFTER(s(N),cons(X,XS)) |
→ AFTER(N,XS) |
|
The approximated dependency graph contains 2 SCCs:
{5}
and {4}.
-
Consider the SCC {5}.
There are no usable rules.
By taking the AF π with
π(AFTER) = 1 together with
the lexicographic path order with
empty precedence,
rule 5
is strictly decreasing.
-
Consider the SCC {4}.
There are no usable rules.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 4, 2006